________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 19:56:58
Input Data from:  dataset104.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,162
Average f[i]   :4050
Average g[i,j] :2018,75
Total demand   :5100
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	960	1	-1	5	5000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0    >new incumb.: 960


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	1580	1	-1	2	11000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0    >new incumb.: 1580


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 35
> Selected Move:	2240	1	-1	8	17000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0    >new incumb.: 2240


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	2210	3	2	9	15000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 36
> Selected Move:	2330	1	-1	4	20000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1    >new incumb.: 2330


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 25
> Selected Move:	2330	3	8	7	20000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 27
> Selected Move:	2330	3	4	6	19500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	2250	3	6	3	19000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 32
> Selected Move:	2390	3	5	8	20000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1    >new incumb.: 2390


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 28
> Selected Move:	2300	3	7	5	19000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 30
> Selected Move:	2240	3	3	6	19500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 29
> Selected Move:	2100	3	8	2	19500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 35
> Selected Move:	2200	3	6	4	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 31
> Selected Move:	2110	3	4	3	19000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 33
> Selected Move:	2180	3	5	8	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 29
> Selected Move:	2100	3	8	7	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 28
> Selected Move:	2100	3	2	4	19000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 32
> Selected Move:	2100	3	4	6	18500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 27
> Selected Move:	2010	3	7	5	17500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 30
> Selected Move:	2130	3	1	8	19700


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 23
> Selected Move:	2044	4	8	5	20200


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 24
> Selected Move:	1940	2	3	-1	16200


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 26
> Selected Move:	2100	3	9	2	18200


> New Y[]: 
	
	 2  0  1  0  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 26
> Selected Move:	2100	4	5	2	17200


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 27
> Selected Move:	2100	4	2	6	19500


> New Y[]: 
	
	 2  0  1  0  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 20
> Selected Move:	2100	4	6	8	17700


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 26
> Selected Move:	2060	3	6	4	18200


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 26
> Selected Move:	2060	4	8	2	17700


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 26
> Selected Move:	2060	4	2	4	19000


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 20
> Selected Move:	2060	4	4	5	18700


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 24
> Selected Move:	2010	3	2	9	16700


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 26
> Selected Move:	2010	4	5	4	17000


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 24
> Selected Move:	2010	4	4	8	16200


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 25
> Selected Move:	2010	4	8	9	17600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 24
> Selected Move:	1940	3	4	6	17100


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 25
> Selected Move:	1940	4	9	6	17500


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	4	6	8	15700


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 28
> Selected Move:	1940	3	6	7	17200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 25
> Selected Move:	2030	3	8	1	15000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 35
> Selected Move:	2225	1	-1	8	21000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 20
> Selected Move:	1990	2	5	-1	16000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 35
> Selected Move:	2040	3	9	2	18000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 36
> Selected Move:	2100	3	8	5	17000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 36
> Selected Move:	2070	3	5	3	16000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 37
> Selected Move:	1990	1	-1	5	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 29
> Selected Move:	2010	3	7	4	20000


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 34
> Selected Move:	2010	3	2	9	18000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 29
> Selected Move:	2010	3	3	6	18500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 31
> Selected Move:	2010	2	6	-1	14000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 29
> Selected Move:	2010	3	9	2	16000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 33
> Selected Move:	2010	3	4	6	15500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 34
> Selected Move:	2010	1	-1	3	19500


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 32
> Selected Move:	2030	3	6	8	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 26
> Selected Move:	1995	3	3	9	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 26
> Selected Move:	1970	3	5	6	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 31
> Selected Move:	1973	3	8	7	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 31
> Selected Move:	1975	3	9	3	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 57 #######################


> Neighbours evaluated; 30
> Selected Move:	1948	3	3	5	21500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 58 #######################


> Neighbours evaluated; 27
> Selected Move:	1940	3	7	8	21500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	1878	3	8	4	20500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 60 #######################


> Neighbours evaluated; 29
> Selected Move:	1790	3	6	7	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 61 #######################


> Neighbours evaluated; 24
> Selected Move:	1890	2	5	-1	17000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 62 #######################


> Neighbours evaluated; 34
> Selected Move:	1890	3	2	9	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 63 #######################


> Neighbours evaluated; 33
> Selected Move:	1925	1	-1	8	21000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 64 #######################


> Neighbours evaluated; 25
> Selected Move:	1925	3	4	6	20500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 65 #######################


> Neighbours evaluated; 24
> Selected Move:	1890	3	8	4	19500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 66 #######################


> Neighbours evaluated; 23
> Selected Move:	1810	3	6	2	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 67 #######################


> Neighbours evaluated; 23
> Selected Move:	1885	3	7	8	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 68 #######################


> Neighbours evaluated; 26
> Selected Move:	1840	3	2	3	19000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 69 #######################


> Neighbours evaluated; 27
> Selected Move:	1840	3	1	5	20700


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 70 #######################


> Neighbours evaluated; 15
> Selected Move:	1996	4	5	8	20200


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 71 #######################


> Neighbours evaluated; 20
> Selected Move:	1853	3	3	6	20700


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 72 #######################


> Neighbours evaluated; 21
> Selected Move:	1889	3	4	7	21700


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 73 #######################


> Neighbours evaluated; 18
> Selected Move:	1886	3	5	3	20700


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 74 #######################


> Neighbours evaluated; 23
> Selected Move:	1882	4	8	7	20700


> New Y[]: 
	
	 2  0  0  1  0  0  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 75 #######################


> Neighbours evaluated; 25
> Selected Move:	1890	3	8	5	19700


> New Y[]: 
	
	 2  0  0  1  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 76 #######################


> Neighbours evaluated; 26
> Selected Move:	1910	3	7	2	19200


> New Y[]: 
	
	 2  0  3  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 77 #######################


> Neighbours evaluated; 28
> Selected Move:	1862	3	6	8	20700


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 78 #######################


> Neighbours evaluated; 23
> Selected Move:	1848	3	8	7	20700


> New Y[]: 
	
	 2  0  3  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,365

## ITERATION 79 #######################


> Neighbours evaluated; 22
> Selected Move:	1837	3	5	6	20200


> New Y[]: 
	
	 2  0  3  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,37

## ITERATION 80 #######################


> Neighbours evaluated; 25
> Selected Move:	1836	3	7	8	20200


> New Y[]: 
	
	 2  0  3  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 81 #######################


> Neighbours evaluated; 24
> Selected Move:	1840	3	2	1	18500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 82 #######################


> Neighbours evaluated; 24
> Selected Move:	1910	3	8	2	18500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 83 #######################


> Neighbours evaluated; 26
> Selected Move:	1833	3	0	5	20200


> New Y[]: 
	
	 0  3  1  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 84 #######################


> Neighbours evaluated; 28
> Selected Move:	1910	4	5	2	19700


> New Y[]: 
	
	 0  3  2  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 85 #######################


> Neighbours evaluated; 30
> Selected Move:	1890	3	2	7	19500


> New Y[]: 
	
	 0  3  0  1  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 86 #######################


> Neighbours evaluated; 19
> Selected Move:	1840	3	7	8	19900


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,405

## ITERATION 87 #######################


> Neighbours evaluated; 16
> Selected Move:	1810	2	6	-1	15400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,4

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	1940	3	3	7	17400


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	4	8	5	17700


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,39

## ITERATION 90 #######################


> Neighbours evaluated; 24
> Selected Move:	1940	4	5	7	17000


> New Y[]: 
	
	 0  3  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,385

## ITERATION 91 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	4	7	9	19000


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 92 #######################


> Neighbours evaluated; 25
> Selected Move:	1940	3	9	0	17000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 93 #######################


> Neighbours evaluated; 32
> Selected Move:	1940	3	0	2	19200


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 94 #######################


> Neighbours evaluated; 26
> Selected Move:	1940	4	2	5	19700


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 95 #######################


> Neighbours evaluated; 24
> Selected Move:	1940	4	5	7	19000


> New Y[]: 
	
	 0  3  1  0  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 96 #######################


> Neighbours evaluated; 26
> Selected Move:	1940	4	7	8	19400


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 97 #######################


> Neighbours evaluated; 27
> Selected Move:	1810	3	5	3	18400


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,35

## ITERATION 98 #######################


> Neighbours evaluated; 25
> Selected Move:	1810	4	8	2	18200


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,345

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	1810	4	2	7	18000


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,34

## ITERATION 100 #######################


> Neighbours evaluated; 25
> Selected Move:	1810	3	2	9	16000


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,335

## ITERATION 101 #######################


> Neighbours evaluated; 17
> Selected Move:	1825	1	-1	5	21000


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 102 #######################


> Neighbours evaluated; 15
> Selected Move:	1770	3	8	2	21000


> New Y[]: 
	
	 0  3  1  1  0  1  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 103 #######################


> Neighbours evaluated; 26
> Selected Move:	1748	3	5	6	20500


> New Y[]: 
	
	 0  3  1  1  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,32

## ITERATION 104 #######################


> Neighbours evaluated; 21
> Selected Move:	1686	4	7	2	20700


> New Y[]: 
	
	 0  3  2  1  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 105 #######################


> Neighbours evaluated; 23
> Selected Move:	1827	3	2	5	20200


> New Y[]: 
	
	 0  3  0  1  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 106 #######################


> Neighbours evaluated; 22
> Selected Move:	1776	3	7	8	20200


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,325

## ITERATION 107 #######################


> Neighbours evaluated; 21
> Selected Move:	1810	2	6	-1	15700


> New Y[]: 
	
	 0  3  0  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,33

## ITERATION 108 #######################


> Neighbours evaluated; 18
> Selected Move:	1810	4	5	3	17100


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,335

## ITERATION 109 #######################


> Neighbours evaluated; 16
> Selected Move:	1810	4	3	9	17000


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 18
> Selected Move:	1810	3	5	7	18000


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 12
> Selected Move:	1810	4	9	3	18100


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,35

## ITERATION 112 #######################


> Neighbours evaluated; 11
> Selected Move:	1810	4	3	8	16400


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1 
 > pw :0,345

## ITERATION 113 #######################


> Neighbours evaluated; 13
> Selected Move:	1920	3	8	0	14000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 114 #######################


> Neighbours evaluated; 30
> Selected Move:	1930	3	7	5	13000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 115 #######################


> Neighbours evaluated; 29
> Selected Move:	1980	3	9	2	15000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 116 #######################


> Neighbours evaluated; 28
> Selected Move:	1840	3	1	8	17200


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 117 #######################


> Neighbours evaluated; 26
> Selected Move:	1940	3	3	7	19200


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 118 #######################


> Neighbours evaluated; 21
> Selected Move:	1940	4	8	2	18700


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 119 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	4	2	5	19700


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 120 #######################


> Neighbours evaluated; 20
> Selected Move:	1940	4	5	7	19200


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 121 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	3	2	9	17200


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 122 #######################


> Neighbours evaluated; 25
> Selected Move:	1940	4	7	5	17700


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 123 #######################


> Neighbours evaluated; 24
> Selected Move:	1940	4	5	9	18600


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 124 #######################


> Neighbours evaluated; 24
> Selected Move:	1890	3	8	6	17100


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 125 #######################


> Neighbours evaluated; 30
> Selected Move:	1890	4	9	5	16200


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 126 #######################


> Neighbours evaluated; 29
> Selected Move:	1890	4	5	6	17500


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 127 #######################


> Neighbours evaluated; 27
> Selected Move:	1890	4	6	7	15700


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 128 #######################


> Neighbours evaluated; 28
> Selected Move:	1991	1	-1	8	21700


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 129 #######################


> Neighbours evaluated; 22
> Selected Move:	1867	4	7	5	22200


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 19
> Selected Move:	1838	3	8	3	20200


> New Y[]: 
	
	 2  0  0  1  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 131 #######################


> Neighbours evaluated; 23
> Selected Move:	1859	3	7	2	20200


> New Y[]: 
	
	 2  0  1  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 132 #######################


> Neighbours evaluated; 28
> Selected Move:	1735	3	5	7	20700


> New Y[]: 
	
	 2  0  1  1  0  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 133 #######################


> Neighbours evaluated; 26
> Selected Move:	1794	3	6	5	21200


> New Y[]: 
	
	 2  0  1  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 134 #######################


> Neighbours evaluated; 22
> Selected Move:	1848	3	2	8	21200


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 135 #######################


> Neighbours evaluated; 16
> Selected Move:	1842	4	7	8	21200


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 136 #######################


> Neighbours evaluated; 17
> Selected Move:	1840	2	7	-1	15200


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 137 #######################


> Neighbours evaluated; 22
> Selected Move:	1840	4	8	3	16500


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 138 #######################


> Neighbours evaluated; 24
> Selected Move:	1850	1	-1	6	21000


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 139 #######################


> Neighbours evaluated; 21
> Selected Move:	1817	4	3	9	21100


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 140 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	3	9	1	19500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 141 #######################


> Neighbours evaluated; 28
> Selected Move:	1890	3	8	7	19500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 142 #######################


> Neighbours evaluated; 27
> Selected Move:	1860	3	6	8	21000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 143 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	3	7	4	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 144 #######################


> Neighbours evaluated; 26
> Selected Move:	1810	2	4	-1	15000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 145 #######################


> Neighbours evaluated; 28
> Selected Move:	1840	3	1	2	16700


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 146 #######################


> Neighbours evaluated; 24
> Selected Move:	1840	4	2	3	18500


> New Y[]: 
	
	 2  0  1  3  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 147 #######################


> Neighbours evaluated; 21
> Selected Move:	1840	4	3	5	17700


> New Y[]: 
	
	 2  0  1  1  0  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 148 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	3	2	9	15700


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 149 #######################


> Neighbours evaluated; 22
> Selected Move:	1840	4	5	9	16600


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 150 #######################


> Neighbours evaluated; 20
> Selected Move:	1830	3	5	7	17600


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 151 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	3	3	4	18600


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 152 #######################


> Neighbours evaluated; 23
> Selected Move:	1840	4	9	4	18000


> New Y[]: 
	
	 2  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 153 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	4	4	7	17200


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 154 #######################


> Neighbours evaluated; 25
> Selected Move:	1840	4	7	8	17200


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	1840	3	9	2	19200


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 156 #######################


> Neighbours evaluated; 23
> Selected Move:	1840	4	8	2	18700


> New Y[]: 
	
	 2  0  3  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 157 #######################


> Neighbours evaluated; 24
> Selected Move:	1840	4	2	4	20000


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 158 #######################


> Neighbours evaluated; 20
> Selected Move:	1840	4	4	7	19200


> New Y[]: 
	
	 2  0  1  0  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 159 #######################


> Neighbours evaluated; 23
> Selected Move:	1830	3	4	3	18200


> New Y[]: 
	
	 2  0  1  1  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 160 #######################


> Neighbours evaluated; 26
> Selected Move:	1830	4	7	2	17700


> New Y[]: 
	
	 2  0  3  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 161 #######################


> Neighbours evaluated; 25
> Selected Move:	1830	4	2	3	19500


> New Y[]: 
	
	 2  0  1  3  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 162 #######################


> Neighbours evaluated; 20
> Selected Move:	1830	4	3	8	18200


> New Y[]: 
	
	 2  0  1  1  0  0  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 163 #######################


> Neighbours evaluated; 25
> Selected Move:	1830	3	2	9	16200


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 164 #######################


> Neighbours evaluated; 21
> Selected Move:	1830	4	8	3	17500


> New Y[]: 
	
	 2  0  0  3  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	1830	4	3	7	16200


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 166 #######################


> Neighbours evaluated; 21
> Selected Move:	1810	3	7	1	14000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 167 #######################


> Neighbours evaluated; 24
> Selected Move:	1810	3	9	2	16000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 168 #######################


> Neighbours evaluated; 29
> Selected Move:	2010	1	-1	7	22000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 169 #######################


> Neighbours evaluated; 17
> Selected Move:	2025	3	3	5	23000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 170 #######################


> Neighbours evaluated; 17
> Selected Move:	1970	3	7	4	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 171 #######################


> Neighbours evaluated; 23
> Selected Move:	1860	3	2	7	22000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	1815	3	4	6	21500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 24
> Selected Move:	1908	3	1	9	23100


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 174 #######################


> Neighbours evaluated; 20
> Selected Move:	1874	3	9	2	23200


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 175 #######################


> Neighbours evaluated; 25
> Selected Move:	1908	3	7	3	21200


> New Y[]: 
	
	 2  0  3  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 24
> Selected Move:	1892	3	3	9	21200


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 177 #######################


> Neighbours evaluated; 24
> Selected Move:	1886	3	8	7	21200


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,2

## ITERATION 178 #######################


> Neighbours evaluated; 26
> Selected Move:	1890	2	9	-1	17200


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 27
> Selected Move:	1890	4	2	5	18200


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 180 #######################


> Neighbours evaluated; 29
> Selected Move:	1890	4	5	6	19500


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,215
